Variational Limits of $k$-NN Graph-Based Functionals on Data Clouds
نویسندگان
چکیده
منابع مشابه
Variational Limits of Graph Cuts on Point Clouds
The main goal of this thesis is to develop tools that enable us to study the convergence of minimizers of functionals defined on point clouds towards minimizers of equivalent functionals in the continuum; the point clouds we consider are samples of a ground-truth distribution. In particular, we investigate approaches to clustering based on minimizing objective functionals defined on proximity g...
متن کاملImproved Graph Based K-NN Text Classification
This paper presents an improved graph based k-nn algorithm for text classification. Most of the organization are facing problem of large amount of unorganized data. Most of the existing text classification techniques are based on vector space model which ignores the structural information of the document which is the word order or the co-occurrences of the terms or words. In this paper we have ...
متن کاملDes Secured K-nn Query over Secure Data in Clouds
Protecting databases or data contents from the web world environment is a tough task for a company. Because every Company/ Financial Institute/ Hospital was hiding their customers or end users list secretly and will not open for all. But now Tom’s gang (Hackers) made this possible and tries stealing the data and major portion. In these conditions securing the data outsourcing area such as web h...
متن کاملScalable $k$-NN graph construction
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to construct k-NN graphs remains a challenge, especially for large-scale high-dimensional data. In this paper, we propose a new approach to construct approximate k-NN graphs with emphasis in: efficiency and accuracy. We hierar...
متن کاملFast Online k-nn Graph Building
In this paper we propose an online approximate k-nn graph building algorithm, which is able to quickly update a k-nn graph using a flow of data points. One very important step of the algorithm consists in using the current distributed graph to search for the neighbors of a new node. Hence we also propose a distributed partitioning method based on balanced k-medoids clustering, that we use to op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Mathematics of Data Science
سال: 2019
ISSN: 2577-0187
DOI: 10.1137/18m1188999